Interpolating between random walk and rotor walk
نویسندگان
چکیده
منابع مشابه
Interpolating between random walk and rotor walk
We introduce a family of stochastic processes on the integers, depending on a parameter p ∈ [0, 1] and interpolating between the deterministic rotor walk (p = 0) and the simple random walk (p = 1/2). This p-rotor walk is not a Markov chain but it has a local Markov property: for each x ∈ Z the sequence of successive exits from x is a Markov chain. The main result of this paper identifies the sc...
متن کاملA Random Walk with Exponential Travel Times
Consider the random walk among N places with N(N - 1)/2 transports. We attach an exponential random variable Xij to each transport between places Pi and Pj and take these random variables mutually independent. If transports are possible or impossible independently with probability p and 1-p, respectively, then we give a lower bound for the distribution function of the smallest path at point log...
متن کاملCentral Limit Theorem in Multitype Branching Random Walk
A discrete time multitype (p-type) branching random walk on the real line R is considered. The positions of the j-type individuals in the n-th generation form a point process. The asymptotic behavior of these point processes, when the generation size tends to infinity, is studied. The central limit theorem is proved.
متن کاملZeno's Walk: a Random Walk with Refinements
A self-modifying random walk on Q is deened from an ordinary random walk on the integers by interpolating a new vertex into each edge as it is crossed. This process converges almost surely to a random variable which is totally singular with respect to Lebesgue measure, and which is supported on a subset of R having Hausdorr dimension less than 1. By generating function techniques we then calcul...
متن کاملQuantum Random Walk via Classical Random Walk With Internal States
In recent years quantum random walks have garnered much interest among quantum information researchers. Part of the reason is the prospect that many hard problems can be solved efficiently by employing algorithms based on quantum random walks, in the same way that classical random walks have played a central role in many hugely successful randomized algorithms. In this paper we introduce a new ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures & Algorithms
سال: 2017
ISSN: 1042-9832,1098-2418
DOI: 10.1002/rsa.20747